package 链表算法题;

public class 合并两个排序的链表 {
    public class ListNode {
        int val;
        ListNode next = null;

        ListNode(int val) {
            this.val = val;
        }
    }

    public ListNode Merge(ListNode list1,ListNode list2){
        if (list1==null){
            return list2;
        }
        if (list2==null){
            return list1;
        }
        if (list1.val<=list2.val){
            list1.next = Merge(list1.next,list2);
        }else {
            list2.next = Merge(list2.next,list1);
        }
        return list2;
    }
}
